Higher Dimensional Diophantine Problems

نویسنده

  • SERGE LANG
چکیده

1. Rational points. A classical conjecture of Mordell states that a curve of genus ^ 2 over the rational numbers has only a finite number of rational points. Let K be a finitely generated field over the rational numbers. Then the same statement should hold for a curve defined over K, and a specialization argument due to Néron shows in fact that this latter statement is implied by the corresponding statement over number fields (cf. [L 1, Chapter VII, §6]). Let F be a variety in projective space, defined over the complex numbers, and therefore over some finitely generated field over the rationals. We shall say that V has the Mordell property if it has only a finite number of rational points in any finitely generated field over Q. One possibility to extend Mordell's conjecture to higher dimensional varieties is as follows.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A higher-dimensional Kurzweil theorem for formal Laurent series over finite fields

In a recent paper, Kim and Nakada proved an analogue of Kurzweil’s theorem for inhomogeneous Diophantine approximation of formal Laurent series over finite fields. Their proof used continued fraction theory and thus cannot be easily extended to simultaneous Diophantine approximation. In this note, we give another proof which works for simultaneous Diophantine approximation as well.

متن کامل

A Note on Simultaneous Diophantine Approximation in Positive Characteristic

In a recent paper, Inoue and Nakada proved a 0-1 law and a strong law of large numbers with error term for the number of coprime solutions of the one-dimensional Diophantine approximation problem in the field of formal Laurent series over a finite base field. In this note, we generalize their results to higher dimensions.

متن کامل

Distributed computing of simultaneous Diophantine approximation problems

In this paper we present the Multithreaded Advanced Fast Rational Approximation algorithm – MAFRA – for solving n-dimensional simultaneous Diophantine approximation problems. We show that in some particular applications the Lenstra-Lenstra-Lovász (L) algorithm can be substituted by the presented one in order to reduce their practical running time. MAFRA was implemented in the following architec...

متن کامل

Open Diophantine Problems

Diophantine Analysis is a very active domain of mathematical research where one finds more conjectures than results. We collect here a number of open questions concerning Diophantine equations (including Pillai’s Conjectures), Diophantine approximation (featuring the abc Conjecture) and transcendental number theory (with, for instance, Schanuel’s Conjecture). Some questions related to Mahler’s ...

متن کامل

On the Complexity of Visibility Problems with Moving Viewpoints

We investigate visibility problems with moving viewpoints in n-dimensional space. We show that these problems are NP-hard if the underlying bodies are balls, H-polytopes, or V-polytopes. This is contrasted by polynomial time solvability results for fixed dimension. We relate the computational complexity to existing algebraic-geometric aspects of the visibility problems, to the theory of packing...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2007